A theorem in combinatorial matrix theory

Applications of the Gordan - Stiemke Theorem in Combinatorial Matrix Theory

Abstrad. By u~ of the Gordan-Stiemke Theorem of the alternative we demonstrate the similarity of four theorems in combinatorial matrix theory. Each theorem contains five equivalent conditions, one of which is the existence in a given pattern of a line-sum-symmetric or constant-line-sum matrix which is semi-positive or strictly positive for the pattern. A generalization of the Gordan-Stiemke The...

Feasible Combinatorial Matrix Theory

We give the first, as far as we know, feasible proof of König’s Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, and we show the equivalence of KMM to various Min-Max principles, with proofs of low complexity.

A Useful Theorem in Matrix Theory

Network flows and combinatorial matrix theory

This note gives a very brief introduction to the theory of network flows and some related topics in combinatorial matrix theory. 1 Network flow theory Network flow theory is a mathematical treatment of flows in networks. Actually, the classical and basic treatment of this area is the pioneering monograph by L.R. Ford and D.R. Fulkerson called Flows in networks [9]. A more recent, and highly rec...

certain combinatorial topics in group theory

this article is intended to be a survey on some combinatorial topics in group theory. the bibliography at the end is neither claimed to be exhaustive, nor is it necessarily connected with a reference in the text. i include it as i see it revolves around the concepts which are discussed in the text.